On a Problem of Ammunition Rationing

Suppose you have u units of ammunition and want to destroy as many as possible of a sequence of attacking enemy aircraft. If you fire v = v(u), 0 ~ v ~ u, units of your ammunition at the first enemy, it survives with probability qv, where 0 < q < 1 is given, and then kills you. With the complementary probability, 1 qV, you destroy the aircraft and you live to face the next enemy with only u-v units of ammunition remaining. It seems almost obvious that any strategy which maximizes the expected number of enemies destroyed before you die will fire more units at the first enemy as u increases, Le., it seems obvious that v'(u) ~ 0 under optimal play. We show this to be false thereby disproving an appealing conjecture proposed by Weber. Short title: The Bomber Problem